The Aryabhata Algorithm Using Least Absolute Remainders

نویسنده

  • Sreeram Vuppala
چکیده

The year 2006 has seen renewed interest in the mathematics of Aryabhata (473c.550), the great mathematician-astronomer of Classical India, for potential applications to cryptography. Rao and Yang [1] recently published an analysis of the Aryabhata algorithms for finding of multiplicative inverse of a group modulo a prime as well as the solution to multiple congruences. The RSA 2006 Conference held in San Jose in February also honored Aryabhata.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel LSSVM Based Algorithm to Increase Accuracy of Bacterial Growth Modeling

Background: The recent progress and achievements in the advanced, accurate, and rigorously evaluated algorithms has revolutionized different aspects of the predictive microbiology including bacterial growth.Objectives: In this study, attempts were made to develop a more accurate hybrid algorithm for predicting the bacterial growth curve which can also be ...

متن کامل

A Systolic ON-LINE Non-Restoring Division Scheme

A new improved version of the classic binary non-restoring division algorithm is presented. It is implemented on a systolic ON-LINE architecture, targeted at use in digital signal processing applications. The overall goal is to implement DSP algorithms using redundant data representations throughout the algorithm, and to obtain a balanced architecture according to the speciications of the appli...

متن کامل

Horn Belief Contraction: Remainders, Envelopes and Complexity

A recent direction within belief revision theory is to develop a theory of belief change for the Horn knowledge representation framework. We consider questions related to the complexity aspects of previous work, leading to questions about Horn envelopes (or Horn LUB’s), introduced earlier in the context of knowledge compilation. A characterization is obtained of the remainders of a Horn belief ...

متن کامل

A Database Encryption Scheme Based on the Generalized Aryabhata Remainder Theorem

Database security prevents the disclosure of confidential data within a database to unauthorized users, and has become an urgent challenge for a tremendous number of database applications. Data encryption is a widely-used cryptographic technique for realizing database security in which the data kept in the database are encrypted into ciphertext. Inspired by Lin et al.’s database encryption syst...

متن کامل

An Analytical Model for Predicting the Convergence Behavior of the Least Mean Mixed-Norm (LMMN) Algorithm

The Least Mean Mixed-Norm (LMMN) algorithm is a stochastic gradient-based algorithm whose objective is to minimum a combination of the cost functions of the Least Mean Square (LMS) and Least Mean Fourth (LMF) algorithms. This algorithm has inherited many properties and advantages of the LMS and LMF algorithms and mitigated their weaknesses in some ways. The main issue of the LMMN algorithm is t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/cs/0604012  شماره 

صفحات  -

تاریخ انتشار 2006